A Diagonal Lattice Reduction Algorithm for MIMO Detection
نویسندگان
چکیده
منابع مشابه
Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood receiver, and yet with complexity similar to linear receivers. However, these lattice-reduction-aided detectors are based on the traditional LLL reduction algorithm that was originally introduced for reducing real lattic...
متن کاملLattice Reduction Aided Detection Techniques for Mimo Systems
---------------------------------------------------------------------***--------------------------------------------------------------------Abstract A Multiple input multiple output (MIMO) technology is seen to provide the best solution to high data rate and reliable wireless communication. For the purpose of detection, Maximum Likelihood receivers are most optimal but highly complex especially...
متن کاملLattice-reduction-aided detection for MIMO-OFDM-CDM communication systems
Multiple input multiple output-orthogonal frequency division multiplexing-code division multiplexing (MIMO-OFDM-CDM) techniques are considered to improve the link reliability/spectral efficiency of very high data rate communication systems. In particular, lattice-reduction-aided receivers are proposed for MIMO-OFDM-CDM systems. Simulation results show that the proposed receivers significantly o...
متن کاملLattice Reduction-Aided Detection for Overloaded MIMO Using Slab Decoding
In this paper, we propose an overloaded multiple-input multiple-output (MIMO) signal detection scheme with slab decoding and lattice reduction (LR). The proposed scheme firstly splits the transmitted signal vector into two parts, the post-voting vector composed of the same number of signal elements as that of receive antennas, and the pre-voting vector composed of the remaining elements. Second...
متن کاملA Lattice Basis Reduction Algorithm ∗
In this paper, we give a definition of an optimally reduced basis for a lattice in the sense that an optimally reduced basis is a shortest basis for the lattice. Then we present an algorithm for computing an approximation of an optimally reduced basis for a lattice using a novel unimodular transformation. To compare lattice bases, we propose a quantitative measure of the degree of the linear in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2012
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2012.2191614